Generalized wordlength patterns and strength

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invariance of generalized wordlength patterns

The generalized wordlength pattern (GWLP) introduced by Xu and Wu (2001) for an arbitrary fractional factorial design allows one to extend the use of the minimum aberration criterion to such designs. Ai and Zhang (2004) defined the J-characteristics of a design and showed that they uniquely determine the design. While both the GWLP and the J-characteristics require indexing the levels of each f...

متن کامل

Multiple-Wordlength Resource Binding

This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem is significantly different for addition and multiplication, and techniques to share resources between several operations are examined for FPGA architectures. A novel formulation of the resource binding problem is pre...

متن کامل

Optimum Wordlength Allocation

This paper presents an approach to the wordlength allocation and optimization problem for linear digital signal processing systems implemented in Field-Programmable Gate Arrays. The proposed technique guarantees an optimum set of wordlengths for each internal variable, allowing the user to trade-off implementation area for error at system outputs. Optimality is guaranteed through modelling as a...

متن کامل

Continued Fractions and Generalized Patterns

Babson and Steingrimsson (2000, Séminaire Lotharingien de Combinatoire, B44b, 18) introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Let fτ ;r (n) be the number of 1-3-2-avoiding permutations on n letters that contain exactly r occurrences of τ , where τ is a generalized pattern on k letters. Let Fτ ...

متن کامل

Discovery of Generalized Patterns

The pattern extraction is one of the main problem in data mining. Usually, patterns are deened by a conjunction of simple de-scriptors of the form (variable = value). In this paper we consider a more general form of descriptors, namely (variable 2 valueset), where valueset is a subset of the variable domain. We present methods for generalized pattern extraction. We also investigate the problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Planning and Inference

سال: 2014

ISSN: 0378-3758

DOI: 10.1016/j.jspi.2012.06.015